A Study of Optimisation Approaches to Probabilistic Relaxation Labelling on a 3 Node 2 Label Problem
نویسندگان
چکیده
We present a comparative study of several optimisation approaches used in probabilistic relaxation labelling. For test purposes, we propose a 3 node 2 label variant of Rosenfelds famous triangle labelling problem. Experiments comparing Rosenfelds original probability updating rule with the theoretically better justified projected gradient method of Hummel et al show that the latter is to preferred.
منابع مشابه
Community Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
متن کاملUser Hints for Map Labelling
The Map Labelling Problem appears in several applications, mainly in Cartography. Although much research on this problem has been done, it is interesting to note that map-labelling processes in commercial fields are very often executed manually or with little support of automatic tools. In general, practical map-labelling problems involve human subjective domain knowledge about label placement ...
متن کاملJoint Optimisation for Object Class Segmentation and Dense Stereo Reconstruction
The problems of object class segmentation [2], which assigns an object label such as road or building to every pixel in the image and dense stereo reconstruction, in which every pixel within an image is labelled with a disparity [1], are well suited for being solved jointly. Both approaches formulate the problem of providing a correct labelling of an image as one of Maximum a Posteriori (MAP) e...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کاملNon-rigid motion behaviour learning : a spectral and graphical approach
In this thesis graph spectral methods and kernel methods are combined together for the tasks of rigid and non-rigid feature correspondence matching and consistent labelling. The thesis is divided into five chapters. In Chapter 1 we give a brief introduction and an outline of the thesis. In Chapter 2 we review the main techniques in the literature which are related to the developments in this th...
متن کامل